On the Odir iterative method for non‐symmetric indefinite linear systems
نویسندگان
چکیده
منابع مشابه
On the Odir iterative method for non-symmetric indefinite linear systems
Several Krylov subspace iterative methods have been proposed for the approximation of the solution of general non-symmetric linear systems. Odir is such a method. Here we study the restarted version of Odir for non-symmetric inde nite linear systems and we prove convergence under certain conditions on the matrix of coe cients. These results hold for all the restarted Krylov methods equivalent t...
متن کاملOn the modified iterative methods for $M$-matrix linear systems
This paper deals with scrutinizing the convergence properties of iterative methods to solve linear system of equations. Recently, several types of the preconditioners have been applied for ameliorating the rate of convergence of the Accelerated Overrelaxation (AOR) method. In this paper, we study the applicability of a general class of the preconditioned iterative methods under certain conditio...
متن کاملOn Squaring Krylov Subspace Iterative Methods for Nonsymmetric Linear Systems
The Biorthogonal Lanczos and the Biconjugate Gradients methods have been proposed as iterative methods to approximate the solution of nonsymmetric and indefinite linear systems. Sonneveld [19] obtained the Conjugate Gradient Squared by squaring the matrix polynomials of the Biconjugate Gra dients method. Here we square the Biorthogonal Lanczos, the Biconjugate Residual and the Biconjugate Orth...
متن کاملComparison results on the preconditioned mixed-type splitting iterative method for M-matrix linear systems
Consider the linear system Ax=b where the coefficient matrix A is an M-matrix. In the present work, it is proved that the rate of convergence of the Gauss-Seidel method is faster than the mixed-type splitting and AOR (SOR) iterative methods for solving M-matrix linear systems. Furthermore, we improve the rate of convergence of the mixed-type splitting iterative method by applying a preconditio...
متن کاملAn Adaptive Chebyshev Iterative Method for Nonsymmetric Linear Systems Based on Modiied Moments
Large, sparse nonsymmetric systems of linear equations with a matrix whose eigenvalues lie in the right half plane may be solved by an iterative method based on Chebyshev polynomials for an interval in the complex plane. Knowledge of the convex hull of the spectrum of the matrix is required in order to choose parameters upon which the iteration depends. Adaptive Chebyshev algorithms , in which ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Numerical Linear Algebra with Applications
سال: 2001
ISSN: 1070-5325,1099-1506
DOI: 10.1002/1099-1506(200103)8:2<71::aid-nla230>3.3.co;2-y